github.com/klauspost/compress/zstd.betterFastEncoder.longTable (field)

43 uses

	github.com/klauspost/compress/zstd (current package)
		enc_better.go#L43: 	longTable [betterLongTableSize]prevEntry
		enc_better.go#L68: 			e.longTable = [betterLongTableSize]prevEntry{}
		enc_better.go#L83: 		for i := range e.longTable[:] {
		enc_better.go#L84: 			v := e.longTable[i].offset
		enc_better.go#L85: 			v2 := e.longTable[i].prev
		enc_better.go#L97: 			e.longTable[i] = prevEntry{
		enc_better.go#L168: 			candidateL := e.longTable[nextHashL]
		enc_better.go#L174: 			e.longTable[nextHashL] = prevEntry{offset: off, prev: candidateL.offset}
		enc_better.go#L226: 						e.longTable[h0] = prevEntry{offset: off, prev: e.longTable[h0].offset}
		enc_better.go#L283: 						e.longTable[h0] = prevEntry{offset: off, prev: e.longTable[h0].offset}
		enc_better.go#L360: 				candidateL = e.longTable[nextHashL]
		enc_better.go#L364: 				e.longTable[nextHashL] = prevEntry{offset: s + checkAt + e.cur, prev: candidateL.offset}
		enc_better.go#L429: 			candidateL := e.longTable[nextHashL]
		enc_better.go#L508: 			e.longTable[h0] = prevEntry{offset: off, prev: e.longTable[h0].offset}
		enc_better.go#L535: 			e.longTable[nextHashL] = prevEntry{offset: s + e.cur, prev: e.longTable[nextHashL].offset}
		enc_better.go#L593: 			for i := range e.longTable[:] {
		enc_better.go#L594: 				e.longTable[i] = prevEntry{}
		enc_better.go#L611: 		for i := range e.longTable[:] {
		enc_better.go#L612: 			v := e.longTable[i].offset
		enc_better.go#L613: 			v2 := e.longTable[i].prev
		enc_better.go#L625: 			e.longTable[i] = prevEntry{
		enc_better.go#L686: 			candidateL := e.longTable[nextHashL]
		enc_better.go#L692: 			e.longTable[nextHashL] = prevEntry{offset: off, prev: candidateL.offset}
		enc_better.go#L745: 						e.longTable[h0] = prevEntry{offset: off, prev: e.longTable[h0].offset}
		enc_better.go#L805: 						e.longTable[h0] = prevEntry{offset: off, prev: e.longTable[h0].offset}
		enc_better.go#L885: 				candidateL = e.longTable[nextHashL]
		enc_better.go#L889: 				e.longTable[nextHashL] = prevEntry{offset: s + checkAt + e.cur, prev: candidateL.offset}
		enc_better.go#L947: 			candidateL := e.longTable[nextHashL]
		enc_better.go#L1024: 			e.longTable[h0] = prevEntry{offset: off, prev: e.longTable[h0].offset}
		enc_better.go#L1054: 			e.longTable[nextHashL] = prevEntry{offset: s + e.cur, prev: e.longTable[nextHashL].offset}
		enc_better.go#L1143: 	if len(e.dictLongTable) != len(e.longTable) || dictChanged {
		enc_better.go#L1144: 		if len(e.dictLongTable) != len(e.longTable) {
		enc_better.go#L1145: 			e.dictLongTable = make([]prevEntry, len(e.longTable))
		enc_better.go#L1213: 			copy(e.longTable[:], e.dictLongTable)
		enc_better.go#L1223: 				copy(e.longTable[i*shardSize:(i+1)*shardSize], e.dictLongTable[i*shardSize:(i+1)*shardSize])